On p-creative sets and p-completely creative sets
نویسندگان
چکیده
منابع مشابه
P-Sets and (i)-P-Sets for Real Function Space
We study p-sets and (i)-p-sets for a real function space A and compare them with p-sets for its complexification. We also discuss the relation of p-sets and (i)-p-sets with weak peak sets and weak (i)-peak sets which generalize our result of [7]. Using some of the results, we generalize a result of Izzo [2] (proved for a complex function algebra) for a real function space A. Mathematics Subject...
متن کاملA Note on P-sets
A P-set is a set S of positive integers such that no element of S divides the sum of any two (not necessarily being different) larger elements. Erdös and Sárközy [2] conjectured that there exists a constant c > 0 such that for every P-set S we have |{s ∈ S : s ≤ N}| < N1−c for infinitely many integers N . For P-sets S consisting of pairwise coprime integers this conjecture has been proved by T....
متن کاملOn P - I - Open Sets
The notions of pre-local function, semi-local functions and α-local functions with respect to a topology and an ideal are introduced, and several properties are investigated. Also, the concept of P -I-open sets and P -I-closed sets in ideal topological spaces are discussed. Relations between I-open sets and P -I-open sets are provided, and several properties related to P -I-open sets, pre-local...
متن کاملOn P-selective Sets and EXP Hard Sets
Let PSel be the class of all P-selective sets. We show that DTIME(2nk+a) 6 Pnk T(PSel) for all k; a > 0. It implies EXP 6 Pnc T(PSel) for all c > 0. This greatly improves Toda's result that EXP 6 Ptt(PSel) since Ptt(PSel) is equal to PO(logn) T(PSel). We construct an oracle A such that DTIME(2nk)A PAnk+1+a-T(PSel). We also show that the symmetric di erence of a EPm-hard set and a P-selective se...
متن کاملOn Sets Bounded Truth-Table Reducible to P-selective Sets
We show that if every NP set is polynomial time bounded truth table reducible to some P selective set then NP is contained in DTIME n O p logn In the proof we implement a recursive procedure that reduces the number of nondeterministic steps of a given nondeter ministic computation
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90045-4